基于改进的GM(1,1)-Markov链组合模型广东省单位GDP能耗预测

本文以灰色系统理论的GM(1,1)模型和随机过程理论的Markov链模型为基础构建了一个动态GM(1,1)-Markov链组合预测模型。该模型同时利用了GM(1,1)模型对序列趋势因素良好的拟合能力和Markov链模型对残差序列信息的提取能力。为进一步提高该模型的预测精度,用泰勒(Taylor)近似方法和新信息优先的思想对该模型进行了改进。最后,以1991-2014年广东省单位GDP能耗数据实证了该模型的预测效果。     

Local reconstruction of low‐rank matrices and subspaces

We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field and the goal is to reconstruct a (near‐optimal) matrix that is low‐rank and close to M under some distance function Δ. Furthermore, the reconstruction must be local, i.e., provides access to any desired entry of by reading only a few entries of the input M (ideally, independent of the matrix dimensions n and m). Our formulation of this problem is inspired by the local reconstruction framework of Saks and Seshadhri (SICOMP, 2010). Our main result is a local reconstruction algorithm for the case where Δ is the normalized Hamming distance (between matrices). Given M that is ‐close to a matrix of rank (together with d and ), this algorithm computes with high probability a rank‐d matrix that is ‐close to M. This is a local algorithm that proceeds in two phases. The preprocessing phase reads only random entries of M, and stores a small data structure. The query phase deterministically outputs a desired entry by reading only the data structure and 2d additional entries of M. We also consider local reconstruction in an easier setting, where the algorithm can read an entire matrix column in a single operation. When Δ is the normalized Hamming distance between vectors, we derive an algorithm that runs in polynomial time by applying our main result for matrix reconstruction. For comparison, when Δ is the truncated Euclidean distance and , we analyze sampling algorithms by using statistical learning tools. A preliminary version of this paper appears appears in ECCC, see: http://eccc.hpi-web.de/report/2015/128/ © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 607–630, 2017     

一般梯形模糊逼近算子及其在模糊运输问题中的应用

研究运输成本信息为一般模糊数的模糊运输问题.首先,在保持一般模糊数的核不变的条件下,建立一般模糊数与一般梯形模糊数的距离最小优化模型,通过求解模型得到一般模糊数的一般梯形模糊逼近算子,并给出该逼近算子具有的性质如数乘不变性、平移不变性、连续性等.然后利用该逼近算子将一般模糊运输信息表转换成一般梯形模糊运输信息表,再根据已有GFLCM和GFMDM算法得到模糊运输问题的近似最优解,最后给出具体算例分析说明方法的有效性和合理性.     

Sufficient Dimension Reduction and Variable Selection for Large-p-Small-n Data With Highly Correlated Predictors

Sufficient dimension reduction (SDR) is a paradigm for reducing the dimension of the predictors without losing regression information. Most SDR methods require inverting the covariance matrix of the predictors. This hinders their use in the analysis of contemporary datasets where the number of predictors exceeds the available sample size and the predictors are highly correlated. To this end, by incorporating the seeded SDR idea and the sequential dimension-reduction framework, we propose a SDR method for high-dimensional data with correlated predictors. The performance of the proposed method is studied via extensive simulations. To demonstrate its use, an application to microarray gene expression data where the response is the production rate of riboflavin (vitamin B₂) is presented.     

Approximations in Sobolev spaces by prolate spheroidal wave functions

Recently, there is a growing interest in the spectral approximation by the Prolate Spheroidal Wave Functions (PSWFs) ${\psi }_{n,c},c>0$. This is due to the promising new contributions of these functions in various classical as well as emerging applications from Signal Processing, Geophysics, Numerical Analysis, etc. The PSWFs form a basis with remarkable properties not only for the space of band-limited functions with bandwidth c, but also for the Sobolev space $H^s([?1,1])$. The quality of the spectral approximation and the choice of the parameter c when approximating a function in $H^s([?1,1])$ by its truncated PSWFs series expansion, are the main issues. By considering a function $f\in H^s([?1,1])$ as the restriction to $[?1,1]$ of an almost time-limited and band-limited function, we try to give satisfactory answers to these two issues. Also, we illustrate the different results of this work by some numerical examples.     

Stochastic optimization of an urban rail timetable under time‐dependent and uncertain demand

Urban rail planning is extremely complex, mainly because it is a decision problem under different uncertainties. In practice, travel demand is generally uncertain, and therefore, the timetabling decisions must be based on accurate estimation. This research addresses the optimization of train timetable at public transit terminals of an urban rail in a stochastic setting. To cope with stochastic fluctuation of arrival rates, a two‐stage stochastic programming model is developed. The objective is to construct a daily train schedule that minimizes the expected waiting time of passengers. Due to the high computational cost of evaluating the expected value objective, the sample average approximation method is applied. The method provided statistical estimations of the optimality gap as well as lower and upper bounds and the associated confidence intervals. Numerical experiments are performed to evaluate the performance of the proposed model and the solution method.     

Self-maps of <Emphasis Type="Italic">S</Emphasis><Superscript>2</Superscript> homotopic to a smooth map with a single <Emphasis Type="Italic">n</Emphasis>-periodic point

We show for which (d,n) ∈ Z×N there exists a smooth self-map f:S² → S² so that deg(f)=d and Fix(fⁿ) is a point.     

Reconstruction of the Linear Ordinary Differential System Based on Discrete Points

In this paper, we discuss an inverse problem, i.e., the reconstruction of a linear differential dynamic system from the given discrete data of the solution. We propose a model and a corresponding algorithm to recover the coefficient matrix of the differential system based on the normal vectors from the given discrete points, in order to avoid the problem of parameterization in curve fitting and approximation. We also give some theoretical analysis on our algorithm. When the data points are taken from the solution curve and the set composed of these data points is not degenerate, the coefficient matrix $A$ reconstructed by our algorithm is unique from the given discrete and noisefree data. We discuss the error bounds for the approximate coefficient matrix and the solution which are reconstructed by our algorithm. Numerical examples demonstrate the effectiveness of the algorithm.     

Preparative separation of immunoglobulins from bovine colostrum by continuous divergent-flow electrophoresis

Immunoglobulins in bovine colostrum were separated and fractionated from other proteins using the method and instrumentation developed in our laboratory. The proposed separation was based on bidirectional isotachophoresis/moving boundary electrophoresis with electrofocusing of the analytes in a pH gradient from 3.9 to 10.1. The preparative instrumentation included the trapezoidal non-woven fabric that served as separation space with divergent continuous flow. The defatted and casein precipitate-free colostrum supernatant was loaded directly into the instrument without any additional colostrum pre-preparation. Immunoglobulin G was fractionated from other immune proteins such as bovine serum albumin, β-lactoglobulin, and α-lactalbumin, and was continuously collected in separated fractions over 3 h. The fractions were further processed, and isolated immunoglobulin G in the liquid fractions was confirmed by sodium dodecyl sulfate-polyacrylamide gel electrophoresis and by re-focusing in gel isoelectric focusing. Separated immunoglobulin G was detected in seven fractions by sodium dodecyl sulfate-polyacrylamide gel electrophoresis with a gradually decreased concentration in the fractions. Re-focusing of the proteins in the fractions by gel isoelectric focusing revealed multiple separated zones of immunoglobulin G with the isoelectric point values covering the range from 5.4 to 7.2. Each fraction contained distinct zones with gradually increased isoelectric point values and decreased concentrations from fraction to fraction.